// package leetcode.stack;

// import java.util.LinkedList;

// class MyCircularQueue {
// private int head;
// private int tail;

// /** Initialize your data structure here. Set the size of the queue to be k.
// */
// public MyCircularQueue(int k) {
// LinkedList<Object> circularQuere = new LinkedList<>();

// }

// /**
// * Insert an element into the circular queue. Return true if the operation is
// * successful.
// */
// public boolean enQueue(int value) {

// }

// /**
// * Delete an element from the circular queue. Return true if the operation is
// * successful.
// */
// public boolean deQueue() {

// }

// /** Get the front item from the queue. */
// public int Front() {

// }

// /** Get the last item from the queue. */
// public int Rear() {

// }

// /** Checks whether the circular queue is empty or not. */
// public boolean isEmpty() {

// }

// /** Checks whether the circular queue is full or not. */
// public boolean isFull() {

// }
// }

// /**
// * Your MyCircularQueue object will be instantiated and called as such:
// * MyCircularQueue obj = new MyCircularQueue(k); boolean param_1 =
// * obj.enQueue(value); boolean param_2 = obj.deQueue(); int param_3 =
// * obj.Front(); int param_4 = obj.Rear(); boolean param_5 = obj.isEmpty();
// * boolean param_6 = obj.isFull();
// */